Smooth and adaptive gradient method with retards

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gradient Method with Retards and Generalizations

A generalization of the steepest descent and other methods for solving a large scale symmetric positive definitive system Ax = b is presented. Given a positive integer m, the new iteration is given by xk+1 = xk −λ(xν(k))(Axk − b), where λ(xν(k)) is the steepest descent step at a previous iteration ν(k) ∈ {k, k−1, . . . , max{0, k−m}}. The global convergence to the solution of the problem is est...

متن کامل

Gradient Method with Dynamical Retards for Large-scale Optimization Problems

We consider a generalization of the gradient method with retards for the solution of large-scale unconstrained optimization problems. Recently, the gradient method with retards was introduced to find global minimizers of large-scale quadratic functions. The most interesting feature of this method is that it does not involve a decrease in the objective function, which allows fast local convergen...

متن کامل

The Adaptive Sampling Gradient Method Optimizing Smooth Functions with an Inexact Oracle

Consider settings such as stochastic optimization where a smooth objective function f is unknown but can be estimated with an inexact oracle such as quasi-Monte Carlo (QMC) or numerical quadrature. The inexact oracle is assumed to yield function estimates having error that decays with increasing oracle effort. For solving such problems, we present the Adaptive Sampling Gradient Method (ASGM) in...

متن کامل

Smooth Optimization with Approximate Gradient

We show that the optimal complexity of Nesterov’s smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded error. In applications of this method to semidefinite programs, this often means computing only a few dominant eigenvalues of the current iterate instead of a full matrix exponential, which significantly reduces the method’s...

متن کامل

Adaptive gradient-augmented level set method with multiresolution error estimation

A space-time adaptive scheme is presented for solving advection equations in two space dimensions. The gradient-augmented level set method using a semi-Lagrangian formulation with backward time integration is coupled with a point value multiresolution analysis using Her-mite interpolation. Thus locally refined dyadic spatial grids are introduced which are efficiently implemented with dynamic qu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical and Computer Modelling

سال: 2002

ISSN: 0895-7177

DOI: 10.1016/s0895-7177(02)00266-2